// 求任意子矩阵的和
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int n, m;
int a[N][N], f[N][N];

int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            cin >> a[i][j];
            f[i][j] = a[i][j] + f[i-1][j] + f[i][j-1] - f[i-1][j-1];
        }
    }
    int q; cin >> q;
    while(q--){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int ret = f[x2][y2] + f[x1-1][y1-1] - f[x1-1][y2] - f[x2][y1-1];
        cout << ret << '\n';
    }
    return 0;
}